Stage-graph Representations Jj Org-r Udiger Sack Y{k

Stage-graph Representations

We consider graph applications of the well-known paradigm “killing two birds with one stone”. In the plane, this gives rise to a stage graph as follows: vertices are the points, and {u, II} is an edge if and only if the (infinite, straight) line segment joining u to u intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be con...

The Generalized Wiener Polarity Index of some Graph Operations

Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.

Computing Volumes of Solids Enclosed by Recursive Subdivision Surfaces Jj Org Peters

The volume of a solid enclosed by a recursive subdivision surface can be approximated based on the closed-form representation of regular parts of the subdivision surface and a tight estimate of the local convex hull near extraordinary points. The approach presented is eecient, i.e. non-exponential, and robust in that it yields rapidly contracting error bounding boxes. An extension to measuring ...

Adjacency metric dimension of the 2-absorbing ideals graph

Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

Attractors of Viscous Balance Laws Dissertation Eingereicht Von Jj Org Hh Arterich